Approximation algorithms and hardness results for the clique packing problem
نویسندگان
چکیده
منابع مشابه
Approximation algorithms and hardness results for the clique packing problem
For a fixed family F of graphs, an F -packing in a graphG is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F . Finding an F -packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K2}. In this paper we provide new approximation algorithms and hardness results for the Kr-packing probl...
متن کاملAn approximation hardness result for bipartite Clique
Assuming 3-SAT formulas are hard to refute on average, Feige showed some approximation hardness results for several problems like min bisection, dense k-subgraph, max bipartite clique and the 2-catalog segmentation problem. We show a similar result for max bipartite clique, but under the assumption, 4-SAT formulas are hard to refute on average. As falsity of the 4-SAT assumption implies falsity...
متن کاملApproximation Algorithms for the k-Clique Covering Problem
The problem of covering edges and vertices in a graph or in a hypergraph was motivated by a problem arising in the context of component assembly problem The problem is given a graph and a clique size k nd the minimum number of k cliques such that all edges and vertices of the graph are covered by included in the cliques This paper provides a collection of approximation algorithms for various cl...
متن کاملApproximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands
In the Joint Replenishment Problem (JRP), the goal is to coordinate the replenishments of a collection of goods over time so that continuous demands are satisfied with minimum overall ordering and holding costs. We consider the case when demand rates are constant. Our main contribution is the first hardness result for any variant of JRP with constant demands. When replenishments per commodity a...
متن کاملHardness Results and Approximation Algorithms for the Minimum Dominating Tree Problem
Given an undirected graph G = (V,E) and a weight function w : E → R, the Minimum Dominating Tree problem asks to find a minimum weight sub-tree of G, T = (U,F ), such that every v ∈ V \U is adjacent to at least one vertex in U . The special case when the weight function is uniform is known as the Minimum Connected Dominating Set problem. Given an undirected graph G = (V,E) with some subsets of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.10.017